A nonsmooth algorithm for cone-constrained eigenvalue problems
نویسندگان
چکیده
منابع مشابه
A nonsmooth algorithm for cone-constrained eigenvalue problems
Such an eigenvalue problem arises in mechanics and in other areas of applied mathematics. The symbol K refers to a closed convex cone in the Euclidean space R and (A,B) is a pair of possibly asymmetric matrices of order n. Special attention is paid to the case in which K is the nonnegative orthant of R. The more general case of a possibly unpointed polyhedral convex cone is also discussed in de...
متن کاملSolving inverse cone-constrained eigenvalue problems
We compare various algorithms for constructing a matrix of order n whose Pareto spectrum contains a prescribed set Λ = {λ1, . . . , λp} of reals. In order to avoid overdetermination one assumes that p does not exceed n2. The inverse Pareto eigenvalue problem under consideration is formulated as an underdetermined system of nonlinear equations. We also address the issue of computing Lorentz spec...
متن کاملCone-constrained eigenvalue problems: theory and algorithms
Equilibria in mechanics or in transportation models are not always expressed through a system of equations, but sometimes they are characterized by means of complementarity conditions involving a convex cone. This work deals with the analysis of cone-constrained eigenvalue problems. We discuss some theoretical issues like, for instance, the estimation of the maximal number of eigenvalues in a c...
متن کاملExtensions of Firefly Algorithm for Nonsmooth Nonconvex Constrained Optimization Problems
Firefly Algorithm (FA) is a stochastic population-based algorithm based on the flashing patterns and behavior of fireflies. Original FA was created and successfully applied to solve bound constrained optimization problems. In this paper we present extensions of FA for solving nonsmooth nonconvex constrained global optimization problems. To handle the constraints of the problem, feasibility and ...
متن کاملThe CoMirror algorithm for solving nonsmooth constrained convex problems
We introduce a first-order Mirror-Descent (MD) type algorithm for solving nondifferentiable convex problems having a combination of simple constraint set X (ball, simplex, etc.) and an additional functional constraint. The method is tuned to exploit the structure of X by employing an appropriate non-Euclidean distance-like function. Convergence results and efficiency estimates are derived. The ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Optimization and Applications
سال: 2009
ISSN: 0926-6003,1573-2894
DOI: 10.1007/s10589-009-9297-7